Power and Size of Generalized Communicating P Systems with Minimal Interaction Rules

Generalized communicating P systems

This paper considers a generalization of various communication models based on the P system paradigm where two objects synchronously move across components. More precisely, the model uses blocks of four cells such that pairs of objects from two input cells travel together to target output cells. It is shown that the model introduced, based on interactions between blocks, is complete, being able...

On Generalized Communicating P Systems with One Symbol

Generalized communicating P systems (GCPSs) are purely communicating tissue-like membrane systems with rules for moving pairs of objects. Despite their simplicity, these systems are rather powerful, they are able to generate any recursively enumerable set of numbers even having restricted variants of communication rules. In this paper we show that GCPSs still remain computationally complete if ...

On the Computational Power of 1-Deterministic and Sequential P Systems

The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable assumption. Here we study the computational power of different variants of sequential P-systems. Initially we look at cooperative systems operating on symbol objects and without prioritized rules, but which allow membrane dissolut...

A Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...

Decentralized Interaction Estimators in Large Scale Power Systems with Neural Networks.